Space-filling Curves for Domain Decomposition in Scientific Simulations
نویسندگان
چکیده
Space-filling curves(SFC) have been widely accepted as an easy technique to generate good quality mesh partitions. In this work, we discuss the limitations of some of the existing methods for generating SFCs and propose a recursive algorithm for constructing a general SFC that works for a range of meshes in 2D and 3D. All of our test cases for the 2D SFC come from the meshes used in Community Earth System Model(CESM). We compare the quality of SFC partitions with the existing strategies in CESM in terms of load balance and communication cost.
منابع مشابه
Parallel domain decomposition and load balancing using space-filling curves
Partitioning techniques based on space-filling curves have received much recent attention due to their low running time and good load balance characteristics. The basic idea underlying these methods is to order the multidimensional data according to a space-filling curve and partition the resulting onedimensional order. However, space-filling curves are defined for points that lie on a uniform ...
متن کاملOn domain decomposition with space filling curves for the parallel solution of the coupled Maxwell/Vlasov equations
Space filling Curves (SFCs) are increasingly used for combinatorial scientific computing and in particular for designing fast domain decomposition (partitioning) methods. In the context of parallel particle simulations for solving the system of Maxwell/Vlasov equations with a coupled FE/PIC (Finite Element/Particle-In-Cell) unstructured mesh based solver, one has to deal with a two-constraint p...
متن کاملTwo-constraint domain decomposition with Space Filling Curves
In scientific computing, Space Filling Curves are a widely used tool for one-constraint domain decomposition. They provide a mechanism to sort multi-dimensional data in a locality preserving way, and, in this way, a (one dimensional) list of mesh elements is established which is subsequently split into partitions under consideration of the constraint. This procedure has a runtime of O(N logN) (...
متن کاملSpace Filling Curves for 3D Sensor Networks with Complex Topology
Several aspects of managing a sensor network (e.g., motion planning for data mules, serial data fusion and inference) benefit once the network is linearized to a path. The linearization is often achieved by constructing a space filling curve inside the domain. But existing methods cannot handle networks distributed on surfaces of complex topology. This paper presents a novel method for generati...
متن کاملHash-Storage Techniques for Adaptive Multilevel Solvers and Their Domain Decomposition Parallelization
Partial differential equations can be solved efficiently by adaptive multigrid methods on a parallel computer. We report on the concepts of hash-table storage techniques and space-filling curves to set up such a code. The hash-table storage requires substantial less amount of memory and is easier to code than tree data structures used in traditional adaptive multigrid codes, already for the seq...
متن کامل